Elliptic Curve Cryptosystems
نویسندگان
چکیده
We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure, because the analog of the discrete logarithm problem on elliptic curves is likely to be harder than the classical discrete logarithm problem, especially over GF(2"). We discuss the question of primitive points on an elliptic curve modulo p, and give a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point.
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملDiffie-Hellman type key exchange protocols based on isogenies
In this paper, we propose some Diffie-Hellman type key exchange protocols using isogenies of elliptic curves. The first method which uses the endomorphism ring of an ordinary elliptic curve $ E $, is a straightforward generalization of elliptic curve Diffie-Hellman key exchange. The method uses commutativity of the endomorphism ring $ End(E) $. Then using dual isogenies, we propose...
متن کاملEfficient elliptic curve exponentiation
Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosystems([16]). This is why elliptic curve cryptosystems have begun to attract notice. There are mainly two types in elliptic curve cryptosystems, elliptic curves E over IF2r and E over IFp. Some current systems based on ...
متن کاملEecient Elliptic Curve Exponentiation Using Mixed Coordinates
Elliptic curve cryptosystems, proposed by Koblitz ((12]) and Miller ((16]), can be constructed over a smaller eld of deenition than the ElGamal cryptosystems ((6]) or the RSA cryptosystems ((20]). This is why elliptic curve cryptosystems have begun to attract notice. In this paper, we investigate eecient elliptic curve exponentiation. We propose a new coordinate system and a new mixed coordinat...
متن کاملEfficient Elliptic Curve Exponentiation Using Mixed Coordinates
Elliptic curve cryptosystems, proposed by Koblitz ((11]) and Miller ((15]), can be constructed over a smaller eld of deenition than the ElGamal cryptosystems ((5]) or the RSA cryptosystems ((19]). This is why elliptic curve cryptosystems have begun to attract notice. In this paper, we investigate eecient elliptic curve exponentiation. We propose a new coordinate system and a new mixed coordinat...
متن کامل